Scott Aaronson - PDFSEARCH.IO - Document Search Engine

Scott Aaronson
Results: 49

#	Item
31	¿Quién puede nombrar el mayor número? Scott Aaronson, 1999 http://www.scottaaronson.com/writings/bignumbers.html Traducido por Jorge Alonso* Vigo, 2–3/2006 — v1.1.2 Add to Reading List Source URL: www.geocities.ws Language: Spanish - Date: 2011-04-03 01:50:21
32	The One-Way Communication Complexity of Subgroup Membership Scott Aaronson Massachusetts Institute of Technology Alexander Russell Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2014-07-09 07:03:18 Representation theory Representation theory of finite groups Induced representation Harmonic analysis Weight Group representation Index of a subgroup Normal subgroup Character theory Abstract algebra Group theory Representation theory of Lie groups
33	Three quantum learning algorithms Ashley Montanaro Talk based on joint work with Andris Ambainis and ongoing joint work with Scott Aaronson, David Chen, Daniel Gottesman and Vincent Liew. 11 March 2013 Add to Reading List Source URL: www.damtp.cam.ac.uk Language: English - Date: 2013-03-11 13:38:24 Quantum algorithm Quantum information science Pierian Spring FO Decision tree model Theoretical computer science Applied mathematics Computational complexity theory
34	QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 03:53:50 Quantum complexity theory Quantum information science Models of computation QMA Interactive proof system PP Arthur–Merlin protocol Quantum computer BQP Theoretical computer science Computational complexity theory Applied mathematics
35	Improved Simulation of Stabilizer Circuits Scott Aaronson∗ University of California, Berkeley Daniel Gottesman† Perimeter Institute Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2009-05-26 10:39:45 Mathematics Quantum error correction Controlled NOT gate Gottesman–Knill theorem Quantum circuit Quantum programming Stabilizer code Quantum computer Quantum teleportation Quantum information science Theoretical computer science Applied mathematics
36	scott aaronson, stylometric clustering 17 Stylometric clustering: a comparison of data-driven and syntactic features scott aaronson1 1Computer Science Department, University of California, Berkeley, Berkeley CA[removed] Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 03:54:04 Quantitative linguistics Computational linguistics Natural language processing Multivariate statistics Data mining Cluster analysis K-means clustering Parsing Hierarchical clustering Statistics Linguistics Science
37	ALGORITHMS FOR BOOLEAN FUNCTION QUERY PROPERTIES SCOTT AARONSON∗ Abstract. We investigate efficient algorithms for computing Boolean function properties relevant to query complexity. Such properties include, for exampl Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 03:47:48 Computational complexity theory Analysis of algorithms Boolean algebra Complexity classes Decision tree model Time complexity Circuit complexity Randomized algorithm Circuit Theoretical computer science Applied mathematics Mathematics
38	Quantum Machine Learning Algorithms: Read the Fine Print Scott Aaronson For twenty years, quantum computing has been catnip to science journalists. Not only would a quantum computer harness the notorious weirdness of qua Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2015-02-03 15:32:05 Computational complexity theory Quantum algorithms Quantum computer Algorithm Time complexity Speedup Qubit Quantum mechanics BQP Theoretical computer science Applied mathematics Quantum information science
39	Why Scott should stare at a blank wall and reconsider (or, the conscious grid) Scott Aaronson has taken upon himself to show Add to Reading List Source URL: integratedinformationtheory.org Language: English - Date: 2014-08-15 16:04:49 Phenomenology Cognition Cognitive neuroscience Neuropsychology Consciousness Qualia Intuition Cognitive science Mind Philosophy of mind
40	Research Statement Scott Aaronson January 6, 2007 Most of my research deals with two questions: first, what are the ultimate limits on what can feasibly be computed in the physical world? Second, how can studying those l Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2007-01-11 00:07:45 Computational complexity theory Quantum information science Models of computation Quantum algorithm PP Quantum computer QMA BQP Hidden subgroup problem Theoretical computer science Applied mathematics Quantum complexity theory

UPDATE